Live Music
Archive
Librivox
Free Audio
Metropolitan Museum
Cleveland
Museum of Art
Internet
Arcade
Console Living Room
Open Library
American
Libraries
TV News
Understanding
9/11matt_bentley_-_the_high_complexity_jump-counting_pattern
Bookreader Item Preview
Share or Embed This Item
- Publication date
- 2019-12-10
- Usage
- Attribution-NoDerivs 4.0 International
- Topics
- algorithm, boolean, skipfield, skip, CPU, programming, pattern, performance, C++
- Collection
- opensource
- Language
- English
- Item Size
- 11.7M
This document describes a numeric pattern for indicating skipable items in data sequences and methods to adjust this pattern when the skipable status for an individual item changes. The pattern provides up to 525% faster iteration speeds (dependent on the ratio of skipped to unskipped items) than an equivalent boolean skipfield on a modern pipelined CPU.
